Discrete particle swarm optimisation for ontology alignment
نویسندگان
چکیده
منابع مشابه
Discrete particle swarm optimisation for ontology alignment
Particle swarm optimisation (PSO) is a biologically-inspired, population-based optimisation technique that has been successfully applied to various problems in science and engineering. In the context of semantic technologies, optimisation problems also occur but have rarely been considered as such. This work addresses the problem of ontology alignment, which is the identification of overlaps in...
متن کاملGeometric Particle Swarm Optimisation
Using a geometric framework for the interpretation of crossover of recent introduction, we show an intimate connection between particle swarm optimization (PSO) and evolutionary algorithms. This connection enables us to generalize PSO to virtually any solution representation in a natural and straightforward way. We demonstrate this for the cases of Euclidean, Manhattan and Hamming spaces.
متن کاملPerceptive Particle Swarm Optimisation
Conventional particle swarm optimisation relies on exchanging information through social interaction among individuals. However for real-world problems involving control of physical agents (i.e., robot control), such detailed social interaction is not always possible. In this study, we propose the Perceptive Particle Swarm Optimisation algorithm, in which both social interaction and environment...
متن کاملStandard Particle Swarm Optimisation
Since 2006, three successive standard PSO versions have been put on line on the Particle Swarm Central [10], namely SPSO 2006, 2007, and 2011. The basic principles of all three versions can be informally described the same way, and in general, this statement holds for almost all PSO variants. However, the exact formulae are slightly di erent, because they took advantage of latest theoretical an...
متن کاملBeyond Standard Particle Swarm Optimisation
Currently, two very similar versions of PSO are available that could be called “standard”. While it is easy to merge them, their common drawbacks still remain. Therefore, in this paper, the author goes beyond simple merging by suggesting simple yet robust changes and solving a few well-known, common problems, while retaining the classical structure. The results can be proposed to the “swarmer c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Sciences
سال: 2012
ISSN: 0020-0255
DOI: 10.1016/j.ins.2010.08.013